An OFDMA resource allocation algorithm based on coalitional games
نویسندگان
چکیده
منابع مشابه
An OFDMA resource allocation algorithm based on coalitional games
This work investigates a fair adaptive resource management criterion (in terms of transmit powers and subchannel assignment) for the uplink of an orthogonal frequency-division multiple access network, populated by mobile users with constraints in terms of target data rates. The inherent optimization problem is tackled with the analytical tools of coalitional game theory, and a practical algorit...
متن کاملLow complexity resource allocation for OFDMA based on coalitional game theory
This work investigates a fair adaptive resource management criterion (in terms of transmit powers and subchannel assignment) for the uplink of an orthogonal frequency division multiple access (OFDMA) network, populated by mobile users with constraints in terms of target data rates. The inherent optimization problem is tackled with the analytical tools of coalitional game theory, and a practical...
متن کاملRich Coalitional Resource Games
We propose a simple model of interaction for resourceconscious agents. The resources involved are expressed in fragments of Linear Logic. We investigate a few problems relevant to cooperative games, such as deciding whether a group of agents can form a coalition and act together in a way that satisfies all of them. In terms of solution concepts, we study the computational aspects of the core of...
متن کاملSolving coalitional resource games
Article history: Received 10 April 2008 Received in revised form 18 September 2009 Accepted 22 September 2009 Available online 25 September 2009
متن کاملResource allocation in OFDMA networks based on interior point methods
This paper studies a joint optimization problem of sub-carrier assignment and power allocation in orthogonal frequency division multiple access (OFDMA) wireless networks. A major challenge in solving the optimization problem is non-convexity caused by the combinatorial nature of sub-carrier assignment problem and/or non-convex objective functions. To address the combinatorial complexity, we for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking
سال: 2011
ISSN: 1687-1499
DOI: 10.1186/1687-1499-2011-46